Relating CAT(0) cubical complexes and flag simplicial complexes
نویسندگان
چکیده
Given a finite CAT(0) cubical complex, we define flag simplicial complex associated to it, called the crossing complex. We show that holds much of combinatorial information original complex: for example, hyperplanes in correspond vertex links and is balanced if only cubically balanced. The most significant result sets f-vectors complexes are equal, up an invertible linear transformation.
منابع مشابه
Simplicial and Cubical Complexes: Analogies and Differences
The research summarized in this thesis consists essentially of two parts. In the first, we generalize a coloring theorem of Baxter about triangulations of the plane (originally used to prove combinatorially Brouwer's fixed point theorem in two dimensions) to arbitrary dimensions and to oriented simplicial and cubical pseudomanifolds. We show that in a certain sense no other generalizations may ...
متن کاملOn simplicial and cubical complexes with short links
We consider closed simplicial and cubical n-complexes in terms of link of their (n−2)faces. Especially, we consider the case, when this link has size 3 or 4, i.e., every (n − 2)face is contained in 3 or 4 n-faces. Such simplicial complexes with short (i.e. of length 3 or 4) links are completely classified by their characteristic partition. We consider also embedding into hypercubes of the skele...
متن کاملSimplicial simple-homotopy of flag complexes in terms of graphs
A flag complex can be defined as a simplicial complex whose simplices correspond to complete subgraphs of its 1-skeleton taken as a graph. In this article, by introducing the notion of s-dismantlability, we shall define the s-homotopy type of a graph and show in particular that two finite graphs have the same s-homotopy type if, and only if, the two flag complexes determined by these graphs hav...
متن کاملNew methods for constructing shellable simplicial complexes
A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...
متن کاملCompletions and Simplicial Complexes
We first introduce the notion of a completion. Completions are inductive properties which may be expressed in a declarative way and which may be combined. We show that completions may be used for describing structures or transformations which appear in combinatorial topology. We present two completions, 〈CUP〉 and 〈CAP〉, in order to define, in an axiomatic way, a remarkable collection of acyclic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2023
ISSN: ['1090-2074', '0196-8858']
DOI: https://doi.org/10.1016/j.aam.2023.102502